Optimized hash for network path encoding with minimized false positives

نویسندگان

  • Laura Carrea
  • Alexei Vernitski
  • Martin Reed
چکیده

The Bloom filter is a space efficient randomized data structure for representing a set and supporting membership queries. Bloom filters intrinsically allow false positives. However, the space savings they offer outweigh the disadvantage if the false positive rates are kept sufficiently low. Inspired by the recent application of the Bloom filter in a novel multicast forwarding fabric, this paper proposes a variant of the Bloom filter, the optihash. The optihash introduces an optimization for the false positive rate at the stage of Bloom filter formation using the same amount of space at the cost of slightly more processing than the classic Bloom filter. Often Bloom filters are used in situations where a fixed amount of space is a primary constraint. We present the optihash as a good alternative to Bloom filters since the amount of space is the same and the improvements in false positives can justify the additional processing. Specifically, we show via simulations and numerical analysis that using the optihash the false positives occurrences can be reduced and controlled at a cost of small additional processing. The simulations are carried out for in-packet forwarding. In this framework, the Bloom filter is used as a compact link/route identifier and it is placed in the packet header to encode Preprint submitted to Computer Networks July 24, 2013 the route. At each node, the Bloom filter is queried for membership in order to make forwarding decisions. A false positive in the forwarding decision is translated into packets forwarded along an unintended outgoing link. By using the optihash, false positives can be reduced. The optimization processing is carried out in an entity termed the Topology Manger which is part of the control plane of the multicast forwarding fabric. This processing is only carried out on a per-session basis, not for every packet. The aim of this paper is to present the optihash and evaluate its false positive performances via simulations in order to measure the influence of different parameters on the false positive rate. The false positive rate for the optihash is then compared with the false positive probability of the classic Bloom filter.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Scheme for Memory - E cient Probabilistic Veri cation

In veri cation by explicit state enumeration, for each reachable state of the protocol being veri ed the full state descriptor is stored in a state table. Two probabilistic methods { bitstate hashing and hash compaction { have been proposed in the literature that store much fewer bits for each state but come at the price of some probability that not all reachable states will be explored during ...

متن کامل

2 A New Scheme for Memory - E cient Probabilistic Veri

In veriication by explicit state enumeration, for each reachable state of the protocol being veriied the full state descriptor is stored in a state table. Two probabilistic methods { bitstate hashing and hash compaction { have been proposed in the literature that store much fewer bits for each state but come at the price of some probability that not all reach-able states will be explored during...

متن کامل

Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters

A Bloom filter is a compact data structure that supports membership queries on a set, allowing false positives. The simplicity and the excellent performance of a Bloom filter make it a standard data structure of great use in many network applications. In reducing the false positive rate of a Bloom filter, it is well known that the size of a Bloom filter and accordingly the number of hash indice...

متن کامل

Improved Procedure for Screening Expression Libraries for Novel Autoantigens

The standard method for immunoscreening of a cDNA expression library is time-consuming becauseof the production of a large proportion of false positives during the first and second round of screening.This problem is more important when a sensitive chemiluminescence detection system is used. Due tothe high sensitivity of the detection system, there is a need to avoid false posi...

متن کامل

Structural Brain Network: What is the Effect of LiFE Optimization of Whole Brain Tractography?

Structural brain networks constructed based on diffusion-weighted MRI (dMRI) have provided a systems perspective to explore the organization of the human brain. Some redundant and nonexistent fibers, however, are inevitably generated in whole brain tractography. We propose to add one critical step while constructing the networks to remove these fibers using the linear fascicle evaluation (LiFE)...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 58  شماره 

صفحات  -

تاریخ انتشار 2014